Pivotal decompositions of functions
نویسندگان
چکیده
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon its values at two given elements. Pivotal decompositions appear to hold for various function classes, such as the class of lattice polynomial functions or the class of multilinear polynomial functions. We also define function classes characterized by pivotal decompositions and function classes characterized by their unary members and investigate links between these two concepts.
منابع مشابه
DECOMPOS: An Integrated System for Functional Decomposition
This paper presents a system for disjoint decompositions of logic functions with many inputs. It is a combination of three di erent methods: 1) Disjoint decompositions with a few bound set variables; 2) Disjoint bi-decompositions; and 3) Decompositions using Jacobian. 1) and 2) are quick, but nd only limited classes of decompositions, while 3) nds all disjoint decompositions by spending more ti...
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کاملDecomposition of supra soft locally closed sets and supra SLC-continuity
In this paper, we introduce two different notions of generalized supra soft sets namely supra A--soft sets and supra soft locally closed sets in supra soft topological spaces, which are weak forms of supra open soft sets and discuss their relationships with each other and other supra open soft sets [{it International Journal of Mathematical Trends and Technology} (IJMTT), (2014) Vol. 9 (1):37--...
متن کاملOn Decomposability and Interaction Functions
A formal notion of a Boolean-function decomposition was introduced recently and used to provide lower bounds on various representations of Boolean functions, which are subsets of decomposable negation normal form (DNNF). This notion has introduced a fundamental optimization problem for DNNF representations, which calls for computing decompositions of minimal size for a given partition of the fu...
متن کاملFinding All Simple Disjoint Decompositions in Frequent Itemset Data
(Abstract) In this paper, we propose a method of finding simple disjoint decompositions in frequent itemset data. The techniques for decomposing Boolean functions have been studied for long time in the area of logic circuit design, and recently , there is a very efficient algorithm to find all possible simple disjoint decompositions for a given Boolean functions based on BDDs (Binary Decision D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 174 شماره
صفحات -
تاریخ انتشار 2014